Asynchronous Parallel Distributed Genetic Algorithm by Layered Server-Client Model
نویسندگان
چکیده
منابع مشابه
Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملHeuristic Algorithm for Client - Server Distributed Computing
The distributed processing systems contain many nodes connected into one logical structure that is able to perform the processing of given task. The task is submitted by the system operator – and from his point of view the system is inputted with a task, computing layer processes the task and the result is returned by the system. Such layer-oriented approach requires to design the operational m...
متن کاملAsynchronous Parallel Distributed Genetic Algorithm with Elite Migration
In most of the popular implementation of Parallel GAs the whole population is divided into a set of subpopulations, each subpopulation executes GA independently and some individuals are migrated at fixed intervals on a ring topology. In these studies, the migrations usually occur ‘synchronously’ among subpopulations. Therefore, CPUs are not used efficiently and the communication do not occur ef...
متن کاملAsynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete problem description. The information exchange between the individuals is done by simulating biological principles of evolution. The PGA is totally asynchronous, running with maximal eeciency on MIMD parallel computers. The s...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2009
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.22.1